PartitionChain: A Scalable and Reliable Data Storage Strategy for Permissioned Blockchain

Blockchain, a specific distributed database which maintains list of data records against tampering and corruption, has aroused wide interests become hot topic in the real world. Nevertheless, increasingly heavy storage consumption brought by full-replication mechanism, becomes bottleneck to system scalability. To address this problem, reliable scheme named BFT-Store (Qi et al. 2020), integrating erasure coding with Byzantine Fault Tolerance (BFT), was proposed recently. While, three critical problems are still left open: (i) The complex re-initialization process blockchain when number nodes varies; (ii) high computational overload downloading data; (iii) massive communication on network. This paper proposes better trade-off for termed PartitionChain addresses above problems, maintaining merits BFT-Store. First, our allows original merely update single aggregate signature (e.g., 320 bits) varies. Using signatures as proof encoded not only saves costs but also gets rid trusted third party. Second, complexity retrieving decoding, compared BFT-Store, is greatly reduced about $2^{18}$ times each node. Third, amount transmitted recovering block from notation="LaTeX">$O(n)$ (assuming notation="LaTeX">$n$ nodes) notation="LaTeX">$O(1)$ , partitioning into smaller pieces applying Reed-Solomon block. Furthermore, introduces reputation ranking where malicious behaviors can be detected marked, enabling check credits node termly expel misbehavior extent. Comparing suit dynamic network higher efficiency